Universal Prediction of Random Binary Sequences in a Noisy Environment by Tsachy Weissman and Neri Merhav

Let X = {(Xt ,Yt )}t∈Z be a stationary time series where Xt is binary valued and Yt , the noisy observation of Xt , is real valued. Letting P denote the probability measure governing the joint process {(Xt ,Yt )}, we characterize U(l,P), the optimal asymptotic average performance of a predictor allowed to base its prediction for Xt on Y1, . . . , Yt−1, where performance is evaluated using the loss function l. It is shown that the stationarity and ergodicity of P, combined with an additional “conditional mixing” condition, suffice to establish U(l,P) as the fundamental limit for the almost sure asymptotic performance. U(l,P) can thus be thought of as a generalized notion of the Shannon entropy, which can capture the sensitivity of the underlying clean sequence to noise. For the case where X = {Xt } is governed by P and Yt given by Yt = g(Xt ,Nt ) where g is any deterministic function and N = {Nt }, the noise, is any i.i.d. process independent of X (namely, the case where the “clean” process X is passed through a fixed memoryless channel), it is shown that, analogously to the noiseless case, there exist universal predictors which do not depend on P yet attain U(l,P). Furthermore, it is shown that in some special cases of interest [e.g., the binary symmetric channel (BSC) and the absolute loss function], there exist twofold universal predictors which do not depend on the noise distribution either. The existence of such universal predictors is established by means of an explicit construction which builds on recent advances in the theory of prediction of individual sequences in the presence of noise.